Process Algebra with Recursive Operations
نویسندگان
چکیده
3 Axiomatisation of the Binary Kleene Star 15 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Completeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3 Irredundancy of the Axioms . . . . . . . . . . . . . . . . . . . . . . . 24 3.4 Negative Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.5 Extensions of BPA∗(A) . . . . . . . . . . . . . . . . . . . . . . . . . 27
منابع مشابه
A Generalised Relational Data Model
A generalised relational data model is formalised for the representation of data with nested structure of arbitrary depth. A recursive algebra for the proposed model is presented. All the operations are formally defined. The proposed model is proved to be a superset of the conventional relational model (CRM). The functionality and validity of the model is shown by a prototype implementation tha...
متن کاملUnguardedness mostly means many solutions
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, in some process algebra, of a recursive specification, i.e., a system of recursive equations over the fundamental operations of the process algebra. The method only works if the recursive specification has a unique solution in the process algebra; it is well-known that guardedness is a sufficient ...
متن کاملUnguarded Recursion on Coinductive Resumptions
A pervasive challenge in programming theory and practice are feature combinations. Here, we propose a semantic framework that combines monad-based computational effects (e.g. store, nondeterminism, random), underdefined or free operations (e.g. actions in process algebra and automata, exceptions), and recursive definitions (e.g. loops, systems of process equations). The joint treatment of these...
متن کاملUsing Computer Algebra techniques for the specification, verification and synthesis of recursive programs
We describe an innovative method for proving total correctness of tail recursive programs having a specific structure, namely programs in which an auxiliary tail recursive function is driven by a main nonrecursive function, and only the specification of the main function is provided. The specification of the auxiliary function is obtained almost fully automatically by solving coupled linear rec...
متن کاملCharacterizing Computable Analysis with Differential Equations
The functions of Computable Analysis are defined by enhancing the capacities of normal Turing Machines to deal with real number inputs. We consider characterizations of these functions using function algebras, known as Real Recursive Functions. Bournez and Hainry 2006 [5] used a function algebra to characterize the twice continuously differentiable functions of Computable Analysis, restricted t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006